Automating Proofs in Category Theory
نویسندگان
چکیده
We introduce a semi-automated proof system for basic category-theoretic reasoning. It is based on a first-order sequent calculus that captures the basic properties of categories, functors and natural transformations as well as a small set of proof tactics that automate proof search in this calculus. We demonstrate our approach by automating the proof that the functor categories Fun[C × D,E] and Fun[C,Fun[D,E]] are naturally isomorphic.
منابع مشابه
Nuprl as Logical Framework for Automating Proofs in Category Theory
We describe the construction of a semi-automated proof system for elementary category theory using the Nuprl proof development system as logical framework. We have used Nuprl’s display mechanism to implement the basic vocabulary and Nuprl’s rule compiler to implemented a first-order proof calculus for reasoning about categories, functors and natural transformations. To automate proofs we have f...
متن کاملInjectivity in a category: an overview on smallness conditions
Some of the so called smallness conditions in algebra as well as in category theory, are important and interesting for their own and also tightly related to injectivity, are essential boundedness, cogenerating set, and residual smallness. In this overview paper, we first try to refresh these smallness condition by giving the detailed proofs of the results mainly by Bernhard Banaschewski and W...
متن کاملAutomating Proofs of Partially Ordered Model Transformations
This report discusses the feasibility of automating the proofs of transformations between partially ordered models. It extends the work of the author’s initial report [12] on model transformations with constructive type theory, by formalising a model as a partial order over classes, and a model transformation as a nested set of pre and post-conditions. This opens up the proofs of common kinds o...
متن کاملA History of Selected Topics in Categorical Algebra I: From Galois Theory to Abstract Commutators and Internal Groupoids
This paper is a chronological survey, with no proofs, of a direction in categorical algebra, which is based on categorical Galois theory and involves generalized central extensions, commutators, and internal groupoids in Barr exact Mal’tsev and more general categories. Galois theory proposes a notion of central extension, and motivates the study of internal groupoids, which is then used as an a...
متن کاملCategory Theory to Yoneda's Lemma
This development proves Yoneda's lemma and aims to be readable by humans. It only defines what is needed for the lemma: categories, func-tors and natural transformations. Limits, adjunctions and other important concepts are not included. There is no explanation or discussion in this document. See [O'K04] for this and a survey of category theory formalisations.
متن کامل